منابع مشابه
Primitive Recursive Functions
1. Definition of recursive functions. In this paper, we shall consider certain reductions in the recursion scheme for defining primitive recursive functions. Hereafter, we shall refer to such functions simply as recursive functions. In §1, we define what is meant by a recursive function, and also define some recursive functions which will be used. The statement of the principal results of the p...
متن کاملExtended Primitive Recursive Functions
— In this paper we extend the notion of primitive recursive function to the case in which the domain is N* and the range is a subset oj N*. We give a rigorvus characterization oj tins class oj functions and show différences icith the classical primitive recursive functions. Résumé. — Dans cette note nous étendons la notion de f onction primitive recursive à tous les cas dans lesquels le domaine...
متن کاملUnary Primitive Recursive Functions
In this article, we will study certain reductions in the schemes that conform unary primitive recursive functions (i.e. primitive recursive functions of one argument) and we will extend some results previously researched by R. M. Robinson in [15]. Furthermore, we will introduce formal notation for unary primitive recursive functions. §
متن کاملPrimitive computations in speech processing.
Previous research suggests that artificial-language learners exposed to quasi-continuous speech can learn that the first and the last syllables of words have to belong to distinct classes (e.g., Endress & Bonatti, 2007; Pena, Bonatti, Nespor, & Mehler, 2002). The mechanisms of these generalizations, however, are debated. Here we show that participants learn such generalizations only when the cr...
متن کاملPrimitive Recursive Bars Are Inductive
Using Martín Escardó’s « effectful forcing » technique, we demonstrate the constructive validity of Brouwer’s monotone Bar Theorem for any System T-definable bar. We have not assumed any non-constructive (Classical or Brouwerian) principles in this proof, and have carried out the entire development formally in the Agda proof assistant [13] for Martin-Löf ’s Constructive TypeTheory. In 2013, Mar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 1967
ISSN: 0029-4527
DOI: 10.1305/ndjfl/1094068844